Dynamic Threshold Cryptosystem without Group Manager
نویسندگان
چکیده
منابع مشابه
Dynamic Threshold Cryptosystem without Group Manager
In dynamic networks with flexible memberships, group signatures and distributed signatures are an important problem. Dynamic threshold cryptosystems are best suited to realize distributed signatures in dynamic (e.g. meshed) networks. Without a group manager or a trusted third party even more flexible scenarios can be realized. Gennaro et al. [6] showed, it is possible to dynamically increase th...
متن کاملA Self-Certified Group-Oriented Cryptosystem Without a Combiner
In a (t;n) group-oriented cryptosystem, collaboration of at least t participants is required to perform the group transformation. Two important issues in implementation of a such cryptosystems are: 1. the sender needs to collect authenticated public keys of the intended receivers; 2. the combiner needs a secure channel to collect (privately) the partial results from collaborating participants. ...
متن کاملImproved self-certified group-oriented cryptosystem without a combiner
In 2001, Ghodosi and Saeednia proposed a self-certified group-oriented cryptosystem without a combiner to prevent the Susilo et al. s attack. However, in this paper we will show that their scheme is still insecure and probably suffers from the conspired attack. To remedy the weakness, an enhanced version is proposed while providing the new functionality to confirm the source of the encrypted me...
متن کاملA Flexible Threshold Cryptosystem 1
| This paper presents a group-oriented (t;n) threshold cryptosystem in which the sender determines the threshold parameter t and selects the group of intended receivers. The proposed scheme is practical, eecient and non-interactive. It does not need any trusted clerks or trusted key distribution centers. The security of the scheme is equivalent to the security of the original ElGamal cryptosystem.
متن کاملA Length-Flexible Threshold Cryptosystem with Applications
We propose a public-key cryptosystem which is derived from the Paillier cryptosystem. The scheme inherits the attractive homomorphic properties of Paillier encryption. In addition, we achieve two new properties: First, all users can use the same modulus when generating key pairs, this allows more efficient proofs of relations between different encryptions. Second, we can construct a threshold d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Network Protocols and Algorithms
سال: 2009
ISSN: 1943-3581
DOI: 10.5296/npa.v1i1.161